Modules identification by a Dynamical Clustering algorithm based on chaotic Rössler oscillators
نویسندگان
چکیده
A new dynamical clustering algorithm for the identification of modules in complex networks has been recently introduced [1]. In this paper we present a modified version of this algorithm based on a system of chaotic Rössler oscillators and we test its sensitivity on real and computer generated networks with a well known modular structure.
منابع مشابه
A Clustering Approach by SSPCO Optimization Algorithm Based on Chaotic Initial Population
Assigning a set of objects to groups such that objects in one group or cluster are more similar to each other than the other clusters’ objects is the main task of clustering analysis. SSPCO optimization algorithm is anew optimization algorithm that is inspired by the behavior of a type of bird called see-see partridge. One of the things that smart algorithms are applied to solve is the problem ...
متن کاملCommunities recognition in the Chesapeake Bay ecosystem by dynamical clustering algorithms based on different oscillators systems
We have recently introduced [1,2] an efficient method for the detection and identification of modules in complex networks, based on the de-synchronization properties (dynamical clustering) of phase oscillators. In this paper we apply the dynamical clustering tecnique to the identification of communities of marine organisms living in the Chesapeake Bay food web. We show that our algorithm is abl...
متن کاملEngineering of synchronization and clustering of a population of chaotic chemical oscillators.
Description, control, and design of weakly interacting dynamical units are challenging tasks that play a central role in many physical, chemical, and biological systems. Control of temporal and spatial variations of reaction rates is especially daunting when the dynamical units exhibit deterministic chaotic oscillations that are sensitive to initial conditions and are long-term unpredictable. C...
متن کاملNon-linear Fractional-Order Chaotic Systems Identification with Approximated Fractional-Order Derivative based on a Hybrid Particle Swarm Optimization-Genetic Algorithm Method
Although many mathematicians have searched on the fractional calculus since many years ago, but its application in engineering, especially in modeling and control, does not have many antecedents. Since there are much freedom in choosing the order of differentiator and integrator in fractional calculus, it is possible to model the physical systems accurately. This paper deals with time-domain id...
متن کاملImproved COA with Chaotic Initialization and Intelligent Migration for Data Clustering
A well-known clustering algorithm is K-means. This algorithm, besides advantages such as high speed and ease of employment, suffers from the problem of local optima. In order to overcome this problem, a lot of studies have been done in clustering. This paper presents a hybrid Extended Cuckoo Optimization Algorithm (ECOA) and K-means (K), which is called ECOA-K. The COA algorithm has advantages ...
متن کامل